Speed up secure hash algorithm (sha) using single instruction multiple data (simd) architectures

ABSTRACT

A processing apparatus comprises logic to, according to a selected secure hash algorithm (SHA) algorithm, generate hash values by preparing message schedules for a plurality of message blocks in parallel using single instruction multiple date (SIMD) instructions and performing compression in serial, and logic to generate a message digest conforming to the secure hash algorithm (SHA) algorithm.

FIELD OF THE INVENTION

The present disclosure relates to Secure Hash Algorithm (SHA) and inparticular to reducing computation time for SHA message scheduling andhence reducing overall computation time for a SHA message digest.

DESCRIPTION OF RELATED ART

Guaranteeing message and code integrity is very important for thesecurity of applications, operating systems and the networkinfrastructure of the future Internet. Protection against intentionalalteration of data may be supported using one way hash functions. A oneway hash function is a mathematical construct that accepts as input amessage of some length and returns a digest of much smaller length. Oneway hash functions are designed in such a way that it is computationallyinfeasible to find the input message by knowing only the digest. FederalInformation Processing Standard (FIPS) 180-2, published by the NationalInstitute of Standards and Technology (NIST), defines a variety of oneway hash functions: SHA-1, SHA-224, SHA-256, SHA-384 and SHA-512, whichare widely used in a variety of secure internet protocols, for example,TLS, SSL, PGP, SSH, S/MIME and IPsec protocols.

One disadvantage with using these algorithms may be that they are timeconsuming when implemented in software. For example, the SHA messagedigest computation involves multiple shifts, XOR and ADD operations thatare combined in multiple rounds. Because of this reason, one way hashfunctions consume a substantial number of processor clocks whenexecuting, which limits their applicability to high speed secure networkapplications (e.g., 10 Gbps e-commerce transactions), or protectionagainst malware (e.g., virus detection or hashed code execution). Inparticular, the computation time required by the server platforms forimplementing secure internet protocols is severely dragging performanceand throughput of the server platforms.

Accordingly, current techniques for performing one way hash functionsare time-consuming and/or cost-prohibitive and there is a need in theart to reduce the computation time for generating message digests.

DESCRIPTION OF THE FIGURES

Embodiments are illustrated by way of example and not limitation in theFigures of the accompanying drawings:

FIG. 1A is a block diagram of a system according to one embodiment;

FIG. 1B is a block diagram of a system according to one embodiment;

FIG. 1C is a block diagram of a system according to one embodiment;

FIG. 2 is a block diagram of a processor according to one embodiment;

FIG. 3A illustrates packed data types according to one embodiment;

FIG. 3B illustrates packed data types according one embodiment;

FIG. 3C illustrates packed data types according to one embodiment;

FIG. 3D illustrates an instruction encoding according to one embodiment;

FIG. 3E illustrates an instruction encoding according to one embodiment;

FIG. 3F illustrates an instruction encoding according to one embodiment;

FIG. 4A illustrates elements of a processor micro-architecture accordingto one embodiment;

FIG. 4B illustrates elements of a processor micro-architecture accordingto one embodiment;

FIG. 5 is a block diagram of a processor according to one embodiment;

FIG. 6 is a block diagram of a computer system according to oneembodiment;

FIG. 7 is a block diagram of a computer system according to oneembodiment;

FIG. 8 is a block diagram of a computer system according to oneembodiment;

FIG. 9 is a block diagram of a system-on-a-chip according to oneembodiment;

FIG. 10 is a block diagram of a processor according to one embodiment;

FIG. 11 is a block diagram of an IP core development system according toone embodiment;

FIG. 12 illustrates an architecture emulation system according to oneembodiment.

FIG. 13 illustrates a system to translate instructions according to oneembodiment;

FIG. 14 is an illustration of a method of performing a SHA digestcomputation using SIMD instructions according to one embodiment;

FIG. 15 illustrates a process to perform parallel SHA message schedulingusing SIMD instructions according to one embodiment.

DETAILED DESCRIPTION

The following description describes an instruction and processing logicto perform a SHA digest computation using SIMD instructions within or inassociation with a processor, computer system, or other processingapparatus. In the following description, numerous specific details suchas processing logic, processor types, micro-architectural conditions,events, enablement mechanisms, and the like are set forth in order toprovide a more thorough understanding of embodiments of the presentinvention. It will be appreciated, however, by one skilled in the artthat the invention may be practiced without such specific details.Additionally, some well known structures, circuits, and the like havenot been shown in detail to avoid unnecessarily obscuring embodiments ofthe present invention.

One embodiment of the present invention may provide a single core ormulti-core processor. The processor may be coupled to a storage devicethat stores an application program that implements a method. The methodmay comprise receiving a message, preprocessing the message according toa selected SHA algorithm to generate N message blocks, and generatinghash values for message blocks 4×(i−1)+1, 4×(i−1)+2, 4×(i−1)+3 and4×(i−1)+4, where i=1 to floor(N/n). The number n may be determined basedon processor's supported SIMD register width and the selected SHAalgorithm's word size. The hash values may be generated by preparing nmessage schedules in parallel using SIMD instructions and performingcompression in serial for the respective n message blocks. The methodmay further comprise generating hash values for any remaining messageblocks by preparing message schedules and performing compression for theremaining message blocks in serial, and generating a message digestconforming to the selected SHA algorithm.

Although the following embodiments are described with reference to aprocessor, other embodiments are applicable to other types of integratedcircuits and logic devices. Similar techniques and teachings ofembodiments of the present invention can be applied to other types ofcircuits or semiconductor devices that can benefit from higher pipelinethroughput and improved performance. The teachings of embodiments of thepresent invention are applicable to any processor or machine thatperforms data manipulations. However, the present invention is notlimited to processors or machines that perform 1024 bit, 512 bit, 256bit, 128 bit, 64 bit, 32 bit, or 16 bit data operations and can beapplied to any processor and machine in which manipulation or managementof data is performed.

Although the below examples describe instruction handling anddistribution in the context of execution units and logic circuits, otherembodiments of the present invention can be accomplished by way of adata or instructions stored on a machine-readable, tangible medium,which when performed by a machine cause the machine to perform functionsconsistent with at least one embodiment of the invention. In oneembodiment, functions associated with embodiments of the presentinvention are embodied in machine-executable instructions. Theinstructions can be used to cause a general-purpose or special-purposeprocessor that is programmed with the instructions to perform the stepsof the present invention. Embodiments of the present invention may beprovided as a computer program product or software which may include amachine or computer-readable medium having stored thereon instructionswhich may be used to program a computer (or other electronic devices) toperform one or more operations according to embodiments of the presentinvention. Alternatively, steps of embodiments of the present inventionmight be performed by specific hardware components that containfixed-function logic for performing the steps, or by any combination ofprogrammed computer components and fixed-function hardware components.

Instructions used to program logic to perform embodiments of theinvention can be stored within a memory in the system, such as DRAM,cache, flash memory, or other storage. Furthermore, the instructions canbe distributed via a network or by way of other computer readable media.Thus a machine-readable medium may include any mechanism for storing ortransmitting information in a form readable by a machine (e.g., acomputer), but is not limited to, floppy diskettes, optical disks,Compact Disc, Read-Only Memory (CD-ROMs), and magneto-optical disks,Read-Only Memory (ROMs), Random Access Memory (RAM), ErasableProgrammable Read-Only Memory (EPROM), Electrically ErasableProgrammable Read-Only Memory (EEPROM), magnetic or optical cards, flashmemory, or a tangible, machine-readable storage used in the transmissionof information over the Internet via electrical, optical, acoustical orother forms of propagated signals (e.g., carrier waves, infraredsignals, digital signals, etc.). Accordingly, the computer-readablemedium includes any type of tangible machine-readable medium suitablefor storing or transmitting electronic instructions or information in aform readable by a machine (e.g., a computer). The instructions mayinclude any suitable type of code, for example, source code, compiledcode, interpreted code, executable code, static code, dynamic code, orthe like, and may be implemented using any suitable high-level,low-level, object-oriented, visual, compiled and/or interpretedprogramming language, e.g., C, C++, Java, assembly language, machinecode, or the like.

Scientific, financial, auto-vectorized general purpose, RMS(recognition, mining, and synthesis), and visual and multimediaapplications (e.g., 2D/3D graphics, image processing, videocompression/decompression, voice recognition algorithms and audiomanipulation) may require the same operation to be performed on a largenumber of data items. In one embodiment, Single Instruction MultipleData (SIMD) refers to a type of instruction that causes a processor toperform an operation on multiple data elements. SIMD technology may beused in processors that can logically divide the bits in a register intoa number of fixed-sized or variable-sized data elements, each of whichrepresents a separate value. For example, in one embodiment, the bits ina 256-bit register may be organized as a source operand containing fourseparate 64-bit data elements, each of which represents a separate64-bit value. In another embodiment, the bits in a 512-bit register maybe organized as a source operand containing eight separate 64-bit dataelements, each of which represents a separate 64-bit value. This type ofdata may be referred to as ‘packed’ data type or ‘vector’ data type, andoperands of this data type are referred to as packed data operands orvector operands. In one embodiment, a packed data item or vector may bea sequence of packed data elements stored within a single register, anda packed data operand or a vector operand may be a source or destinationoperand of a SIMD instruction (or ‘packed data instruction’ or a ‘vectorinstruction’). In one embodiment, a SIMD instruction specifies a singlevector operation to be performed on two source vector operands togenerate a destination vector operand (also referred to as a resultvector operand) of the same or different size, with the same ordifferent number of data elements, and in the same or different dataelement order.

SIMD technology, such as that employed by the Intel® Core™ processorshaving an instruction set including x86, MMX™, Streaming SIMD Extensions(SSE), SSE2, SSE3, SSE4.1, SSE4.2, Advanced Vector Extensions (AVX),AVX2 and AVX3 instructions, ARM processors, such as the ARM Cortex®family of processors having an instruction set including the VectorFloating Point (VFP) and/or NEON instructions, and MIPS processors, suchas the Loongson family of processors developed by the Institute ofComputing Technology (ICT) of the Chinese Academy of Sciences, hasenabled a significant improvement in application performance (Core™ andMMX™ are registered trademarks or trademarks of Intel Corporation ofSanta Clara, Calif.).

FIG. 1A is a block diagram of an exemplary computer system formed with aprocessor that includes execution units to execute an instruction inaccordance with one embodiment of the present invention. System 100includes a component, such as a processor 102 to employ execution unitsincluding logic to perform algorithms for process data, in accordancewith the present invention, such as in the embodiment described herein.System 100 is representative of processing systems based on the PENTIUM®III, PENTIUM® 4, Xeon™, Itanium®, XScaIe™ and/or StrongARM™microprocessors available from Intel Corporation of Santa Clara, Calif.,although other systems (including PCs having other microprocessors,engineering workstations, set-top boxes and the like) may also be used.In one embodiment, sample system 100 may execute a version of theWINDOWS™ operating system available from Microsoft Corporation ofRedmond, Wash., although other operating systems (UNIX and Linux forexample), embedded software, and/or graphical user interfaces, may alsobe used. Thus, embodiments of the present invention are not limited toany specific combination of hardware circuitry and software.

Embodiments are not limited to computer systems. Alternative embodimentsof the present invention can be used in other devices such as handhelddevices and embedded applications. Some examples of handheld devicesinclude cellular phones, Internet Protocol devices, digital cameras,personal digital assistants (PDAs), and handheld PCs. Embeddedapplications can include a micro controller, a digital signal processor(DSP), system on a chip, network computers (NetPC), set-top boxes,network hubs, wide area network (WAN) switches, or any other system thatcan perform one or more instructions in accordance with at least oneembodiment.

FIG. 1A is a block diagram of an exemplary computer system formed with aprocessor that includes execution units to execute an instruction inaccordance with one embodiment of the present invention. System 100includes a component, such as a processor 102 to employ execution unitsincluding logic to perform algorithms for process data, in accordancewith the present invention, such as in the embodiment described herein.System 100 is representative of processing systems based on the PENTIUM®III, PENTIUM® 4, Xeon™, Itanium®, XScale™ and/or StrongARM™microprocessors available from Intel Corporation of Santa Clara, Calif.,although other systems (including PCs having other microprocessors,engineering workstations, set-top boxes and the like) may also be used.In one embodiment, sample system 100 may execute a version of theWINDOWS™ operating system available from Microsoft Corporation ofRedmond, Wash., although other operating systems (UNIX and Linux forexample), embedded software, and/or graphical user interfaces, may alsobe used. Thus, embodiments of the present invention are not limited toany specific combination of hardware circuitry and software.

Embodiments are not limited to computer systems. Alternative embodimentsof the present invention can be used in other devices such as handhelddevices and embedded applications. Some examples of handheld devicesinclude cellular phones, Internet Protocol devices, digital cameras,personal digital assistants (PDAs), and handheld PCs. Embeddedapplications can include a micro controller, a digital signal processor(DSP), system on a chip, network computers (NetPC), set-top boxes,network hubs, wide area network (WAN) switches, or any other system thatcan perform one or more instructions in accordance with at least oneembodiment.

FIG. 1A is a block diagram of a computer system 100 formed with aprocessor 102 that includes one or more execution units 108 to performan algorithm to perform at least one instruction in accordance with oneembodiment of the present invention. One embodiment may be described inthe context of a single processor desktop or server system, butalternative embodiments can be included in a multiprocessor system.System 100 is an example of a ‘hub’ system architecture. The computersystem 100 includes a processor 102 to process data signals. Theprocessor 102 can be a complex instruction set computer (CISC)microprocessor, a reduced instruction set computing (RISC)microprocessor, a very long instruction word (VLIW) microprocessor, aprocessor implementing a combination of instruction sets, or any otherprocessor device, such as a digital signal processor, for example. Theprocessor 102 is coupled to a processor bus 110 that can transmit datasignals between the processor 102 and other components in the system100. The elements of system 100 perform their conventional functionsthat are well known to those familiar with the art.

In one embodiment, the processor 102 includes a Level 1 (L1) internalcache memory 104. Depending on the architecture, the processor 102 canhave a single internal cache or multiple levels of internal cache.Alternatively, in another embodiment, the cache memory can resideexternal to the processor 102. Other embodiments can also include acombination of both internal and external caches depending on theparticular implementation and needs. Register file 106 can storedifferent types of data in various registers including integerregisters, floating point registers, status registers, and instructionpointer register.

Execution unit 108, including logic to perform integer and floatingpoint operations, also resides in the processor 102. The processor 102also includes a microcode (ucode) ROM that stores microcode for certainmacroinstructions. For one embodiment, execution unit 108 includes logicto handle a packed instruction set 109. By including the packedinstruction set 109 in the instruction set of a general-purposeprocessor 102, along with associated circuitry to execute theinstructions, the operations used by many multimedia applications may beperformed using packed data in a general-purpose processor 102. Thus,many multimedia applications can be accelerated and executed moreefficiently by using the full width of a processor's data bus forperforming operations on packed data. This can eliminate the need totransfer smaller units of data across the processor's data bus toperform one or more operations one data element at a time.

Alternate embodiments of an execution unit 108 can also be used in microcontrollers, embedded processors, graphics devices, DSPs, and othertypes of logic circuits. System 100 includes a memory 120. Memory 120can be a dynamic random access memory (DRAM) device, a static randomaccess memory (SRAM) device, flash memory device, or other memorydevice. Memory 120 can store instructions and/or data represented bydata signals that can be executed by the processor 102.

A system logic chip 116 is coupled to the processor bus 110 and memory120. The system logic chip 116 in the illustrated embodiment is a memorycontroller hub (MCH). The processor 102 can communicate to the MCH 116via a processor bus 110. The MCH 116 provides a high bandwidth memorypath 118 to memory 120 for instruction and data storage and for storageof graphics commands, data and textures. The MCH 116 is to direct datasignals between the processor 102, memory 120, and other components inthe system 100 and to bridge the data signals between processor bus 110,memory 120, and system I/O 122. In some embodiments, the system logicchip 116 can provide a graphics port for coupling to a graphicscontroller 112. The MCH 116 is coupled to memory 120 through a memoryinterface 118. The graphics card 112 is coupled to the MCH 116 throughan Accelerated Graphics Port (AGP) interconnect 114.

System 100 uses a proprietary hub interface bus 122 to couple the MCH116 to the I/O controller hub (ICH) 130. The ICH 130 provides directconnections to some I/O devices via a local I/O bus. The local I/O busis a high-speed I/O bus for connecting peripherals to the memory 120,chipset, and processor 102. Some examples are the audio controller,firmware hub (flash BIOS) 128, wireless transceiver 126, data storage124, legacy I/O controller containing user input and keyboardinterfaces, a serial expansion port such as Universal Serial Bus (USB),and a network controller 134. The data storage device 124 can comprise ahard disk drive, a floppy disk drive, a CD-ROM device, a flash memorydevice, or other mass storage device.

For another embodiment of a system, an instruction in accordance withone embodiment can be used with a system on a chip. One embodiment of asystem on a chip comprises of a processor and a memory. The memory forone such system is a flash memory. The flash memory can be located onthe same die as the processor and other system components. Additionally,other logic blocks such as a memory controller or graphics controllercan also be located on a system on a chip.

FIG. 1B illustrates a data processing system 140 which implements theprinciples of one embodiment of the present invention. It will bereadily appreciated by one of skill in the art that the embodimentsdescribed herein can be used with alternative processing systems withoutdeparture from the scope of embodiments of the invention.

Computer system 140 comprises a processing core 159 capable ofperforming at least one instruction in accordance with one embodiment.For one embodiment, processing core 159 represents a processing unit ofany type of architecture, including but not limited to a CISC, a RISC ora VLIW type architecture. Processing core 159 may also be suitable formanufacture in one or more process technologies and by being representedon a machine readable media in sufficient detail, may be suitable tofacilitate said manufacture.

Processing core 159 comprises an execution unit 142, a set of registerfile(s) 145, and a decoder 144. Processing core 159 also includesadditional circuitry (not shown) which is not necessary to theunderstanding of embodiments of the present invention. Execution unit142 is used for executing instructions received by processing core 159.In addition to performing typical processor instructions, execution unit142 can perform instructions in packed instruction set 143 forperforming operations on packed data formats. Packed instruction set 143includes instructions for performing embodiments of the invention andother packed instructions. Execution unit 142 is coupled to registerfile 145 by an internal bus. Register file 145 represents a storage areaon processing core 159 for storing information, including data. Aspreviously mentioned, it is understood that the storage area used forstoring the packed data is not critical. Execution unit 142 is coupledto decoder 144. Decoder 144 is used for decoding instructions receivedby processing core 159 into control signals and/or microcode entrypoints. In response to these control signals and/or microcode entrypoints, execution unit 142 performs the appropriate operations. In oneembodiment, the decoder is used to interpret the opcode of theinstruction, which will indicate what operation should be performed onthe corresponding data indicated within the instruction.

Processing core 159 is coupled with bus 141 for communicating withvarious other system devices, which may include but are not limited to,for example, synchronous dynamic random access memory (SDRAM) control146, static random access memory (SRAM) control 147, burst flash memoryinterface 148, personal computer memory card international association(PCMCIA)/compact flash (CF) card control 149, liquid crystal display(LCD) control 150, direct memory access (DMA) controller 151, andalternative bus master interface 152. In one embodiment, data processingsystem 140 may also comprise an I/O bridge 154 for communicating withvarious I/O devices via an I/O bus 153. Such I/O devices may include butare not limited to, for example, universal asynchronousreceiver/transmitter (UART) 155, universal serial bus (USB) 156,Bluetooth wireless UART 157 and I/O expansion interface 158.

One embodiment of data processing system 140 provides for mobile,network and/or wireless communications and a processing core 159 capableof performing SIMD operations including a text string comparisonoperation. Processing core 159 may be programmed with various audio,video, imaging and communications algorithms including discretetransformations such as a Walsh-Hadamard transform, a fast Fouriertransform (FFT), a discrete cosine transform (DCT), and their respectiveinverse transforms; compression/decompression techniques such as colorspace transformation, video encode motion estimation or video decodemotion compensation; and modulation/demodulation (MODEM) functions suchas pulse coded modulation (PCM).

FIG. 1C illustrates yet alternative embodiments of a data processingsystem that may include execution units to execute an instruction inaccordance with an embodiment of the present invention. In accordancewith one alternative embodiment, data processing system 160 may includea main processor 166, a SIMD coprocessor 161, a cache memory 167, and aninput/output system 168. The input/output system 168 may optionally becoupled to a wireless interface 169. SIMD coprocessor 161 is capable ofperforming operations including instructions in accordance with oneembodiment. Processing core 170 may be suitable for manufacture in oneor more process technologies and by being represented on a machinereadable media in sufficient detail, may be suitable to facilitate themanufacture of all or part of data processing system 160 includingprocessing core 170.

For one embodiment, SIMD coprocessor 161 comprises an execution unit 162and a set of register file(s) 164. One embodiment of main processor 165comprises a decoder 165 to recognize instructions of instruction set 163including instructions in accordance with one embodiment for executionby execution unit 162. For alternative embodiments, SIMD coprocessor 161also comprises at least part of decoder 165B to decode instructions ofinstruction set 163. Processing core 170 also includes additionalcircuitry (not shown) which is not necessary to the understanding ofembodiments of the present invention.

In operation, the main processor 166 executes a stream of dataprocessing instructions that control data processing operations of ageneral type including interactions with the cache memory 167, and theinput/output system 168. Embedded within the stream of data processinginstructions are SIMD coprocessor instructions. The decoder 165 of mainprocessor 166 recognizes these SIMD coprocessor instructions as being ofa type that should be executed by an attached SIMD coprocessor 161.Accordingly, the main processor 166 issues these SIMD coprocessorinstructions (or control signals representing SIMD coprocessorinstructions) on the coprocessor bus 171 where from they are received byany attached SIMD coprocessors. In this case, the SIMD coprocessor 161will accept and execute any received SIMD coprocessor instructionsintended for it.

Data may be received via wireless interface 169 for processing by theSIMD coprocessor instructions. For one example, voice communication maybe received in the form of a digital signal, which may be processed bythe SIMD coprocessor instructions to regenerate digital audio samplesrepresentative of the voice communications. For another example,compressed audio and/or video may be received in the form of a digitalbit stream, which may be processed by the SIMD coprocessor instructionsto regenerate digital audio samples and/or motion video frames. For oneembodiment of processing core 170, main processor 166, and a SIMDcoprocessor 161 are integrated into a single processing core 170comprising an execution unit 162, a set of register file(s) 164, and adecoder 165 to recognize instructions of instruction set 163 includinginstructions in accordance with one embodiment.

FIG. 2 is a block diagram of the micro-architecture for a processor 200that includes logic circuits to perform instructions in accordance withone embodiment of the present invention. In some embodiments, aninstruction in accordance with one embodiment can be implemented tooperate on data elements having sizes of byte, word, doubleword,quadword, etc., as well as datatypes, such as single and doubleprecision integer and floating point datatypes. In one embodiment thein-order front end 201 is the part of the processor 200 that fetchesinstructions to be executed and prepares them to be used later in theprocessor pipeline. The front end 201 may include several units. In oneembodiment, the instruction prefetcher 226 fetches instructions frommemory and feeds them to an instruction decoder 228 which in turndecodes or interprets them. For example, in one embodiment, the decoderdecodes a received instruction into one or more operations called“micro-instructions” or “micro-operations” (also called micro op oruops) that the machine can execute. In other embodiments, the decoderparses the instruction into an opcode and corresponding data and controlfields that are used by the micro-architecture to perform operations inaccordance with one embodiment. In one embodiment, the trace cache 230takes decoded uops and assembles them into program ordered sequences ortraces in the uop queue 234 for execution. When the trace cache 230encounters a complex instruction, the microcode ROM 232 provides theuops needed to complete the operation.

Some instructions are converted into a single micro-op, whereas othersneed several micro-ops to complete the full operation. In oneembodiment, if more than four micro-ops are needed to complete ainstruction, the decoder 228 accesses the microcode ROM 232 to do theinstruction. For one embodiment, an instruction can be decoded into asmall number of micro ops for processing at the instruction decoder 228.In another embodiment, an instruction can be stored within the microcodeROM 232 should a number of micro-ops be needed to accomplish theoperation. The trace cache 230 refers to a entry point programmablelogic array (PLA) to determine a correct micro-instruction pointer forreading the micro-code sequences to complete one or more instructions inaccordance with one embodiment from the micro-code ROM 232. After themicrocode ROM 232 finishes sequencing micro-ops for an instruction, thefront end 201 of the machine resumes fetching micro-ops from the tracecache 230.

The out-of-order execution engine 203 is where the instructions areprepared for execution. The out-of-order execution logic has a number ofbuffers to smooth out and re-order the flow of instructions to optimizeperformance as they go down the pipeline and get scheduled forexecution. The allocator logic allocates the machine buffers andresources that each uop needs in order to execute. The register renaminglogic renames logic registers onto entries in a register file. Theallocator also allocates an entry for each uop in one of the two uopqueues, one for memory operations and one for non-memory operations, infront of the instruction schedulers: memory scheduler, fast scheduler202, slow/general floating point scheduler 204, and simple floatingpoint scheduler 206. The uop schedulers 202, 204, 206, determine when auop is ready to execute based on the readiness of their dependent inputregister operand sources and the availability of the execution resourcesthe uops need to complete their operation. The fast scheduler 202 of oneembodiment can schedule on each half of the main clock cycle while theother schedulers can only schedule once per main processor clock cycle.The schedulers arbitrate for the dispatch ports to schedule uops forexecution.

Register files 208, 210, sit between the schedulers 202, 204, 206, andthe execution units 212, 214, 216, 218, 220, 222, 224 in the executionblock 211. There is a separate register file 208, 210, for integer andfloating point operations, respectively. Each register file 208, 210, ofone embodiment also includes a bypass network that can bypass or forwardjust completed results that have not yet been written into the registerfile to new dependent uops. The integer register file 208 and thefloating point register file 210 are also capable of communicating datawith the other. For one embodiment, the integer register file 208 issplit into two separate register files, one register file for the loworder 32-bits of data and a second register file for the high order 32bits of data. The floating point register file 210 of one embodiment has128 bit wide entries because floating point instructions typically haveoperands from 64 to 128 bits in width.

The execution block 211 contains the execution units 212, 214, 216, 218,220, 222, 224, where the instructions are actually executed. Thissection includes the register files 208, 210, that store the integer andfloating point data operand values that the micro-instructions need toexecute. The processor 200 of one embodiment is comprised of a number ofexecution units: address generation unit (AGU) 212, AGU 214, fast ALU216, fast ALU 218, slow ALU 220, floating point ALU 222, floating pointmove unit 224. For one embodiment, the floating point execution blocks222, 224, execute floating point, MMX, SIMD, and SSE, or otheroperations. The floating point ALU 222 of one embodiment includes a 64bit by 64 bit floating point divider to execute divide, square root, andremainder micro-ops. For embodiments of the present invention,instructions involving a floating point value may be handled with thefloating point hardware. In one embodiment, the ALU operations go to thehigh-speed ALU execution units 216, 218. The fast ALUs 216, 218, of oneembodiment can execute fast operations with an effective latency of halfa clock cycle. For one embodiment, most complex integer operations go tothe slow ALU 220 as the slow ALU 220 includes integer execution hardwarefor long latency type of operations, such as a multiplier, shifts, flaglogic, and branch processing. Memory load/store operations are executedby the AGUs 212, 214. For one embodiment, the integer ALUs 216, 218,220, are described in the context of performing integer operations on 64bit data operands. In alternative embodiments, the ALUs 216, 218, 220,can be implemented to support a variety of data bits including 16, 32,128, 256, etc. Similarly, the floating point units 222, 224, can beimplemented to support a range of operands having bits of variouswidths. For one embodiment, the floating point units 222, 224, canoperate on 128 bits wide packed data operands in conjunction with SIMDand multimedia instructions.

In one embodiment, the uops schedulers 202, 204, 206, dispatch dependentoperations before the parent load has finished executing. As uops arespeculatively scheduled and executed in processor 200, the processor 200also includes logic to handle memory misses. If a data load misses inthe data cache, there can be dependent operations in flight in thepipeline that have left the scheduler with temporarily incorrect data. Areplay mechanism tracks and re-executes instructions that use incorrectdata. Only the dependent operations need to be replayed and theindependent ones are allowed to complete. The schedulers and replaymechanism of one embodiment of a processor are also designed to catchinstruction sequences for text string comparison operations.

The term “registers” may refer to the on-board processor storagelocations that are used as part of instructions to identify operands. Inother words, registers may be those that are usable from the outside ofthe processor (from a programmer's perspective). However, the registersof an embodiment should not be limited in meaning to a particular typeof circuit. Rather, a register of an embodiment is capable of storingand providing data, and performing the functions described herein. Theregisters described herein can be implemented by circuitry within aprocessor using any number of different techniques, such as dedicatedphysical registers, dynamically allocated physical registers usingregister renaming, combinations of dedicated and dynamically allocatedphysical registers, etc. In one embodiment, integer registers storethirty-two bit integer data. A register file of one embodiment alsocontains eight multimedia SIMD registers for packed data. For thediscussions below, the registers are understood to be data registersdesigned to hold packed data, such as 64 bits wide MMX™ registers (alsoreferred to as ‘mm’ registers in some instances) in microprocessorsenabled with MMX technology from Intel Corporation of Santa Clara,Calif. These MMX registers, available in both integer and floating pointforms, can operate with packed data elements that accompany SIMD and SSEinstructions. Similarly, 128 bits wide XMM registers relating to SSE2,SSE3, SSE4, or beyond (referred to generically as “SSEx”) technology and256 bits wide YMM registers relating to AVX, VAX2 or AVX3 can also beused to hold such packed data operands. In one embodiment, in storingpacked data and integer data, the registers do not need to differentiatebetween the two data types. In one embodiment, integer and floatingpoint are either contained in the same register file or differentregister files. Furthermore, in one embodiment, floating point andinteger data may be stored in different registers or the same registers.

In the examples of the following figures, a number of data operands aredescribed. FIG. 3A illustrates various packed data type representationsin multimedia registers according to one embodiment of the presentinvention. FIG. 3A illustrates data types for a packed byte 310, apacked word 320, and a packed doubleword (dword) 330 for 128 bits wideoperands. The packed byte format 310 of this example is 128 bits longand contains sixteen packed byte data elements. A byte is defined hereas 8 bits of data. Information for each byte data element is stored inbit 7 through bit 0 for byte 0, bit 15 through bit 8 for byte 1, bit 23through bit 16 for byte 2, and finally bit 120 through bit 127 for byte15. Thus, all available bits are used in the register. This storagearrangement increases the storage efficiency of the processor. As well,with sixteen data elements accessed, one operation can now be performedon sixteen data elements in parallel.

Generally, a data element is an individual piece of data that is storedin a single register or memory location with other data elements of thesame length. In packed data sequences relating to SSEx technology, thenumber of data elements stored in a XMM register is 128 bits divided bythe length in bits of an individual data element. Similarly, in packeddata sequences relating to MMX and SSE technology, the number of dataelements stored in an MMX register is 64 bits divided by the length inbits of an individual data element. Although the data types illustratedin FIG. 3A are 128 bit long, embodiments of the present invention canalso operate with 64 bit wide or other sized operands. The packed wordformat 320 of this example is 128 bits long and contains eight packedword data elements. Each packed word contains sixteen bits ofinformation. The packed doubleword format 330 of FIG. 3A is 128 bitslong and contains four packed doubleword data elements. Each packeddoubleword data element contains thirty two bits of information. Apacked quadword is 128 bits long and contains two packed quad-word dataelements.

FIG. 3B illustrates alternative in-register data storage formats. Eachpacked data can include more than one independent data element. Threepacked data formats are illustrated; packed half 341, packed single 342,and packed double 343. One embodiment of packed half 341, packed single342, and packed double 343 contain fixed-point data elements. For analternative embodiment one or more of packed half 341, packed single342, and packed double 343 may contain floating-point data elements. Onealternative embodiment of packed half 341 is one hundred twenty-eightbits long containing eight 16-bit data elements. One embodiment ofpacked single 342 is one hundred twenty-eight bits long and containsfour 32-bit data elements. One embodiment of packed double 343 is onehundred twenty-eight bits long and contains two 64-bit data elements. Itwill be appreciated that such packed data formats may be furtherextended to other register lengths, for example, to 96-bits, 160-bits,192-bits, 224-bits, 256-bits or more.

FIG. 3C illustrates various signed and unsigned packed data typerepresentations in multimedia registers according to one embodiment ofthe present invention. Unsigned packed byte representation 344illustrates the storage of an unsigned packed byte in a SIMD register.Information for each byte data element is stored in bit seven throughbit zero for byte zero, bit fifteen through bit eight for byte one, bittwenty-three through bit sixteen for byte two, and finally bit onehundred twenty through bit one hundred twenty-seven for byte fifteen.Thus, all available bits are used in the register. This storagearrangement can increase the storage efficiency of the processor. Aswell, with sixteen data elements accessed, one operation can now beperformed on sixteen data elements in a parallel fashion. Signed packedbyte representation 345 illustrates the storage of a signed packed byte.Note that the eighth bit of every byte data element is the signindicator. Unsigned packed word representation 346 illustrates how wordseven through word zero are stored in a SIMD register. Signed packedword representation 347 is similar to the unsigned packed wordin-register representation 346. Note that the sixteenth bit of each worddata element is the sign indicator. Unsigned packed doublewordrepresentation 348 shows how doubleword data elements are stored. Signedpacked doubleword representation 349 is similar to unsigned packeddoubleword in-register representation 348. Note that the necessary signbit is the thirty-second bit of each doubleword data element.

FIG. 3D is a depiction of one embodiment of an operation encoding(opcode) format 360, having thirty-two or more bits, and register/memoryoperand addressing modes corresponding with a type of opcode formatdescribed in the “IA-32 Intel Architecture Software Developer's ManualVolume 2: Instruction Set Reference,” which is which is available fromIntel Corporation, Santa Clara, Calif. on the world-wide-web (www) atintel.com/design/litcentr. In one embodiment, and instruction may beencoded by one or more of fields 361 and 362. Up to two operandlocations per instruction may be identified, including up to two sourceoperand identifiers 364 and 365. For one embodiment, destination operandidentifier 366 is the same as source operand identifier 364, whereas inother embodiments they are different. For an alternative embodiment,destination operand identifier 366 is the same as source operandidentifier 365, whereas in other embodiments they are different. In oneembodiment, one of the source operands identified by source operandidentifiers 364 and 365 is overwritten by the results of the text stringcomparison operations, whereas in other embodiments identifier 364corresponds to a source register element and identifier 365 correspondsto a destination register element. For one embodiment, operandidentifiers 364 and 365 may be used to identify 32-bit or 64-bit sourceand destination operands.

FIG. 3E is a depiction of another alternative operation encoding(opcode) format 370, having forty or more bits. Opcode format 370corresponds with opcode format 360 and comprises an optional prefix byte378. An instruction according to one embodiment may be encoded by one ormore of fields 378, 371, and 372. Up to two operand locations perinstruction may be identified by source operand identifiers 374 and 375and by prefix byte 378. For one embodiment, prefix byte 378 may be usedto identify 32-bit or 64-bit source and destination operands. For oneembodiment, destination operand identifier 376 is the same as sourceoperand identifier 374, whereas in other embodiments they are different.For an alternative embodiment, destination operand identifier 376 is thesame as source operand identifier 375, whereas in other embodiments theyare different. In one embodiment, an instruction operates on one or moreof the operands identified by operand identifiers 374 and 375 and one ormore operands identified by the operand identifiers 374 and 375 isoverwritten by the results of the instruction, whereas in otherembodiments, operands identified by identifiers 374 and 375 are writtento another data element in another register. Opcode formats 360 and 370allow register to register, memory to register, register by memory,register by register, register by immediate, register to memoryaddressing specified in part by MOD fields 363 and 373 and by optionalscale-index-base and displacement bytes.

Turning next to FIG. 3F, in some alternative embodiments, 64 bit singleinstruction multiple data (SIMD) arithmetic operations may be performedthrough a coprocessor data processing (CDP) instruction. Operationencoding (opcode) format 380 depicts one such CDP instruction having CDPopcode fields 382 and 389. The type of CDP instruction, for alternativeembodiments, operations may be encoded by one or more of fields 383,384, 387, and 388. Up to three operand locations per instruction may beidentified, including up to two source operand identifiers 385 and 390and one destination operand identifier 386. One embodiment of thecoprocessor can operate on 8, 16, 32, and 64 bit values. For oneembodiment, an instruction is performed on integer data elements. Insome embodiments, an instruction may be executed conditionally, usingcondition field 381. For some embodiments, source data sizes may beencoded by field 383. In some embodiments, Zero (Z), negative (N), carry(C), and overflow (V) detection can be done on SIMD fields. For someinstructions, the type of saturation may be encoded by field 384.

FIG. 4A is a block diagram illustrating an in-order pipeline and aregister renaming stage, out-of-order issue/execution pipeline accordingto at least one embodiment of the invention. FIG. 4B is a block diagramillustrating an in-order architecture core and a register renaminglogic, out-of-order issue/execution logic to be included in a processoraccording to at least one embodiment of the invention. The solid linedboxes in FIG. 4A illustrate the in-order pipeline, while the dashedlined boxes illustrates the register renaming, out-of-orderissue/execution pipeline. Similarly, the solid lined boxes in FIG. 4Billustrate the in-order architecture logic, while the dashed lined boxesillustrates the register renaming logic and out-of-order issue/executionlogic.

In FIG. 4A, a processor pipeline 400 includes a fetch stage 402, alength decode stage 404, a decode stage 406, an allocation stage 408, arenaming stage 410, a scheduling (also known as a dispatch or issue)stage 412, a register read/memory read stage 414, an execute stage 416,a write back/memory write stage 418, an exception handling stage 422,and a commit stage 424.

In FIG. 4B, arrows denote a coupling between two or more units and thedirection of the arrow indicates a direction of data flow between thoseunits. FIG. 4B shows processor core 490 including a front end unit 430coupled to an execution engine unit 450, and both are coupled to amemory unit 470.

The core 490 may be a reduced instruction set computing (RISC) core, acomplex instruction set computing (CISC) core, a very long instructionword (VLIW) core, or a hybrid or alternative core type. As yet anotheroption, the core 490 may be a special-purpose core, such as, forexample, a network or communication core, compression engine, graphicscore, or the like.

The front end unit 430 includes a branch prediction unit 432 coupled toan instruction cache unit 434, which is coupled to an instructiontranslation lookaside buffer (TLB) 436, which is coupled to aninstruction fetch unit 438, which is coupled to a decode unit 440. Thedecode unit or decoder may decode instructions, and generate as anoutput one or more micro-operations, micro-code entry points,microinstructions, other instructions, or other control signals, whichare decoded from, or which otherwise reflect, or are derived from, theoriginal instructions. The decoder may be implemented using variousdifferent mechanisms. Examples of suitable mechanisms include, but arenot limited to, look-up tables, hardware implementations, programmablelogic arrays (PLAs), microcode read only memories (ROMs), etc. Theinstruction cache unit 434 is further coupled to a level 2 (L2) cacheunit 476 in the memory unit 470. The decode unit 440 is coupled to arename/allocator unit 452 in the execution engine unit 450.

The execution engine unit 450 includes the rename/allocator unit 452coupled to a retirement unit 454 and a set of one or more schedulerunit(s) 456. The scheduler unit(s) 456 represents any number ofdifferent schedulers, including reservations stations, centralinstruction window, etc. The scheduler unit(s) 456 is coupled to thephysical register file(s) unit(s) 458. Each of the physical registerfile(s) units 458 represents one or more physical register files,different ones of which store one or more different data types, such asscalar integer, scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point, etc., status (e.g., aninstruction pointer that is the address of the next instruction to beexecuted), etc. The physical register file(s) unit(s) 458 is overlappedby the retirement unit 154 to illustrate various ways in which registerrenaming and out-of-order execution may be implemented (e.g., using areorder buffer(s) and a retirement register file(s), using a futurefile(s), a history buffer(s), and a retirement register file(s); using aregister maps and a pool of registers; etc.). Generally, thearchitectural registers are visible from the outside of the processor orfrom a programmer's perspective. The registers are not limited to anyknown particular type of circuit. Various different types of registersare suitable as long as they are capable of storing and providing dataas described herein. Examples of suitable registers include, but are notlimited to, dedicated physical registers, dynamically allocated physicalregisters using register renaming, combinations of dedicated anddynamically allocated physical registers, etc. The retirement unit 454and the physical register file(s) unit(s) 458 are coupled to theexecution cluster(s) 460. The execution cluster(s) 460 includes a set ofone or more execution units 162 and a set of one or more memory accessunits 464. The execution units 462 may perform various operations (e.g.,shifts, addition, subtraction, multiplication) and on various types ofdata (e.g., scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point). While some embodimentsmay include a number of execution units dedicated to specific functionsor sets of functions, other embodiments may include only one executionunit or multiple execution units that all perform all functions. Thescheduler unit(s) 456, physical register file(s) unit(s) 458, andexecution cluster(s) 460 are shown as being possibly plural becausecertain embodiments create separate pipelines for certain types ofdata/operations (e.g., a scalar integer pipeline, a scalar floatingpoint/packed integer/packed floating point/vector integer/vectorfloating point pipeline, and/or a memory access pipeline that each havetheir own scheduler unit, physical register file(s) unit, and/orexecution cluster—and in the case of a separate memory access pipeline,certain embodiments are implemented in which only the execution clusterof this pipeline has the memory access unit(s) 464). It should also beunderstood that where separate pipelines are used, one or more of thesepipelines may be out-of-order issue/execution and the rest in-order.

The set of memory access units 464 is coupled to the memory unit 470,which includes a data TLB unit 472 coupled to a data cache unit 474coupled to a level 2 (L2) cache unit 476. In one exemplary embodiment,the memory access units 464 may include a load unit, a store addressunit, and a store data unit, each of which is coupled to the data TLBunit 472 in the memory unit 470. The L2 cache unit 476 is coupled to oneor more other levels of cache and eventually to a main memory.

By way of example, the exemplary register renaming, out-of-orderissue/execution core architecture may implement the pipeline 400 asfollows: 1) the instruction fetch 438 performs the fetch and lengthdecoding stages 402 and 404; 2) the decode unit 440 performs the decodestage 406; 3) the rename/allocator unit 452 performs the allocationstage 408 and renaming stage 410; 4) the scheduler unit(s) 456 performsthe schedule stage 412; 5) the physical register file(s) unit(s) 458 andthe memory unit 470 perform the register read/memory read stage 414; theexecution cluster 460 perform the execute stage 416; 6) the memory unit470 and the physical register file(s) unit(s) 458 perform the writeback/memory write stage 418; 7) various units may be involved in theexception handling stage 422; and 8) the retirement unit 454 and thephysical register file(s) unit(s) 458 perform the commit stage 424.

The core 490 may support one or more instructions sets (e.g., thex86-instruction set (with some extensions that have been added withnewer versions); the MIPS instruction set of MIPS Technologies ofSunnyvale, Calif.; the ARM instruction set (with optional additionalextensions such as NEON) of ARM Holdings of Sunnyvale, Calif.).

It should be understood that the core may support multithreading(executing two or more parallel sets of operations or threads), and maydo so in a variety of ways including time sliced multithreading,simultaneous multithreading (where a single physical core provides alogical core for each of the threads that physical core issimultaneously multithreading), or a combination thereof (e.g., timesliced fetching and decoding and simultaneous multithreading thereaftersuch as in the Intel® Hyperthreading technology).

While register renaming is described in the context of out-of-orderexecution, it should be understood that register renaming may be used inan in-order architecture. While the illustrated embodiment of theprocessor also includes a separate instruction and data cache units434/474 and a shared L2 cache unit 476, alternative embodiments may havea single internal cache for both instructions and data, such as, forexample, a Level 1 (L1) internal cache, or multiple levels of internalcache. In some embodiments, the system may include a combination of aninternal cache and an external cache that is external to the core and/orthe processor. Alternatively, all of the cache may be external to thecore and/or the processor.

FIG. 5 is a block diagram of a single core processor and a multicoreprocessor 500 with integrated memory controller and graphics accordingto embodiments of the invention. The solid lined boxes in FIG. 5illustrate a processor 500 with a single core 502A, a system agent 510,a set of one or more bus controller units 516, while the optionaladdition of the dashed lined boxes illustrates an alternative processor500 with multiple cores 502A-N, a set of one or more integrated memorycontroller unit(s) 514 in the system agent unit 510, and an integratedgraphics logic 508.

The memory hierarchy includes one or more levels of cache within thecores, a set or one or more shared cache units 506, and external memory(not shown) coupled to the set of integrated memory controller units514. The set of shared cache units 506 may include one or more mid-levelcaches, such as level 2 (L2), level 3 (L3), level 4 (L4), or otherlevels of cache, a last level cache (LLC), and/or combinations thereof.While in one embodiment a ring based interconnect unit 512 interconnectsthe integrated graphics logic 508, the set of shared cache units 506,and the system agent unit 510, alternative embodiments may use anynumber of well-known techniques for interconnecting such units.

In some embodiments, one or more of the cores 502A-N are capable ofmulti-threading. The system agent 510 includes those componentscoordinating and operating cores 502A-N. The system agent unit 510 mayinclude for example a power control unit (PCU) and a display unit. ThePCU may be or include logic and components needed for regulating thepower state of the cores 502A-N and the integrated graphics logic 508.The display unit is for driving one or more externally connecteddisplays.

The cores 502A-N may be homogenous or heterogeneous in terms ofarchitecture and/or instruction set. For example, some of the cores502A-N may be in order while others are out-of-order. As anotherexample, two or more of the cores 502A-N may be capable of execution thesame instruction set, while others may be capable of executing only asubset of that instruction set or a different instruction set.

The processor may be a general-purpose processor, such as a Core™ i3,i5, i7, 2-Duo and Quad, Xeon™, Itanium™, XScale™ or StrongARM™processor, which are available from Intel Corporation, of Santa Clara,Calif. Alternatively, the processor may be from another company, such asARM Holdings, Ltd, MIPS, etc. The processor may be a special-purposeprocessor, such as, for example, a network or communication processor,compression engine, graphics processor, co-processor, embeddedprocessor, or the like. The processor may be implemented on one or morechips. The processor 500 may be a part of and/or may be implemented onone or more substrates using any of a number of process technologies,such as, for example, BiCMOS, CMOS, or NMOS.

FIGS. 6-8 are exemplary systems suitable for including the processor500, while FIG. 9 is an exemplary system on a chip (SoC) that mayinclude one or more of the cores 502. Other system designs andconfigurations known in the arts for laptops, desktops, handheld PCs,personal digital assistants, engineering workstations, servers, networkdevices, network hubs, switches, embedded processors, digital signalprocessors (DSPs), graphics devices, video game devices, set-top boxes,micro controllers, cell phones, portable media players, hand helddevices, and various other electronic devices, are also suitable. Ingeneral, a huge variety of systems or electronic devices capable ofincorporating a processor and/or other execution logic as disclosedherein are generally suitable.

Referring now to FIG. 6, shown is a block diagram of a system 600 inaccordance with one embodiment of the present invention. The system 600may include one or more processors 610, 615, which are coupled tographics memory controller hub (GMCH) 620. The optional nature ofadditional processors 615 is denoted in FIG. 6 with broken lines.

Each processor 610,615 may be some version of the processor 500.However, it should be noted that it is unlikely that integrated graphicslogic and integrated memory control units would exist in the processors610,615. FIG. 6 illustrates that the GMCH 620 may be coupled to a memory640 that may be, for example, a dynamic random access memory (DRAM). TheDRAM may, for at least one embodiment, be associated with a non-volatilecache.

The GMCH 620 may be a chipset, or a portion of a chipset. The GMCH 620may communicate with the processor(s) 610, 615 and control interactionbetween the processor(s) 610, 615 and memory 640. The GMCH 620 may alsoact as an accelerated bus interface between the processor(s) 610, 615and other elements of the system 600. For at least one embodiment, theGMCH 620 communicates with the processor(s) 610, 615 via a multi-dropbus, such as a frontside bus (FSB) 695.

Furthermore, GMCH 620 is coupled to a display 645 (such as a flat paneldisplay). GMCH 620 may include an integrated graphics accelerator. GMCH620 is further coupled to an input/output (I/O) controller hub (ICH)650, which may be used to couple various peripheral devices to system600. Shown for example in the embodiment of FIG. 6 is an externalgraphics device 660, which may be a discrete graphics device coupled toICH 650, along with another peripheral device 670.

Alternatively, additional or different processors may also be present inthe system 600. For example, additional processor(s) 615 may includeadditional processors(s) that are the same as processor 610, additionalprocessor(s) that are heterogeneous or asymmetric to processor 610,accelerators (such as, e.g., graphics accelerators or digital signalprocessing (DSP) units), field programmable gate arrays, or any otherprocessor. There can be a variety of differences between the physicalresources 610, 615 in terms of a spectrum of metrics of merit includingarchitectural, micro-architectural, thermal, power consumptioncharacteristics, and the like. These differences may effectivelymanifest themselves as asymmetry and heterogeneity amongst theprocessors 610, 615. For at least one embodiment, the various processors610, 615 may reside in the same die package.

Referring now to FIG. 7, shown is a block diagram of a second system 700in accordance with an embodiment of the present invention. As shown inFIG. 7, multiprocessor system 700 is a point-to-point interconnectsystem, and includes a first processor 770 and a second processor 780coupled via a point-to-point interconnect 750. Each of processors 770and 780 may be some version of the processor 500 as one or more of theprocessors 610,615.

While shown with only two processors 770, 780, it is to be understoodthat the scope of the present invention is not so limited. In otherembodiments, one or more additional processors may be present in a givenprocessor.

Processors 770 and 780 are shown including integrated memory controllerunits 772 and 782, respectively. Processor 770 also includes as part ofits bus controller units point-to-point (P-P) interfaces 776 and 778;similarly, second processor 780 includes P-P interfaces 786 and 788.Processors 770, 780 may exchange information via a point-to-point (P-P)interface 750 using P-P interface circuits 778, 788. As shown in FIG. 7,IMCs 772 and 782 couple the processors to respective memories, namely amemory 732 and a memory 734, which may be portions of main memorylocally attached to the respective processors.

Processors 770, 780 may each exchange information with a chipset 790 viaindividual P-P interfaces 752, 754 using point to point interfacecircuits 776, 794, 786, 798. Chipset 790 may also exchange informationwith a high-performance graphics circuit 738 via a high-performancegraphics interface 739.

A shared cache (not shown) may be included in either processor oroutside of both processors, yet connected with the processors via P-Pinterconnect, such that either or both processors' local cacheinformation may be stored in the shared cache if a processor is placedinto a low power mode.

Chipset 790 may be coupled to a first bus 716 via an interface 796. Inone embodiment, first bus 716 may be a Peripheral Component Interconnect(PCI) bus, or a bus such as a PCI Express bus or another thirdgeneration I/O interconnect bus, although the scope of the presentinvention is not so limited.

As shown in FIG. 7, various I/O devices 714 may be coupled to first bus716, along with a bus bridge 718 which couples first bus 716 to a secondbus 720. In one embodiment, second bus 720 may be a low pin count (LPC)bus. Various devices may be coupled to second bus 720 including, forexample, a keyboard and/or mouse 722, communication devices 727 and astorage unit 728 such as a disk drive or other mass storage device whichmay include instructions/code and data 730, in one embodiment. Further,an audio I/O 724 may be coupled to second bus 720. Note that otherarchitectures are possible. For example, instead of the point-to-pointarchitecture of FIG. 7, a system may implement a multi-drop bus or othersuch architecture.

Referring now to FIG. 8, shown is a block diagram of a third system 800in accordance with an embodiment of the present invention. Like elementsin FIGS. 7 and 8 bear like reference numerals, and certain aspects ofFIG. 7 have been omitted from FIG. 8 in order to avoid obscuring otheraspects of FIG. 8.

FIG. 8 illustrates that the processors 870, 880 may include integratedmemory and I/O control logic (“CL”) 872 and 882, respectively. For atleast one embodiment, the CL 872, 882 may include integrated memorycontroller units such as that described above in connection with FIGS. 5and 7. In addition. CL 872, 882 may also include I/O control logic. FIG.8 illustrates that not only are the memories 832, 834 coupled to the CL872, 882, but also that I/O devices 814 are also coupled to the controllogic 872, 882. Legacy I/O devices 815 are coupled to the chipset 890.

Referring now to FIG. 9, shown is a block diagram of a SoC 900 inaccordance with an embodiment of the present invention. Similar elementsin FIG. 5 bear like reference numerals. Also, dashed lined boxes areoptional features on more advanced SoCs. In FIG. 9, an interconnectunit(s) 902 is coupled to: an application processor 910 which includes aset of one or more cores 902A-N and shared cache unit(s) 906; a systemagent unit 910; a bus controller unit(s) 916; an integrated memorycontroller unit(s) 914; a set or one or more media processors 920 whichmay include integrated graphics logic 908, an image processor 924 forproviding still and/or video camera functionality, an audio processor926 for providing hardware audio acceleration, and a video processor 928for providing video encode/decode acceleration; an static random accessmemory (SRAM) unit 930; a direct memory access (DMA) unit 932; and adisplay unit 940 for coupling to one or more external displays.

FIG. 10 illustrates a processor containing a central processing unit(CPU) and a graphics processing unit (GPU), which may perform at leastone instruction according to one embodiment. In one embodiment, aninstruction to perform operations according to at least one embodimentcould be performed by the CPU. In another embodiment, the instructioncould be performed by the GPU. In still another embodiment, theinstruction may be performed through a combination of operationsperformed by the GPU and the CPU. For example, in one embodiment, aninstruction in accordance with one embodiment may be received anddecoded for execution on the GPU. However, one or more operations withinthe decoded instruction may be performed by a CPU and the resultreturned to the GPU for final retirement of the instruction. Conversely,in some embodiments, the CPU may act as the primary processor and theGPU as the co-processor.

In some embodiments, instructions that benefit from highly parallel,throughput processors may be performed by the GPU, while instructionsthat benefit from the performance of processors that benefit from deeplypipelined architectures may be performed by the CPU. For example,graphics, scientific applications, financial applications and otherparallel workloads may benefit from the performance of the GPU and beexecuted accordingly, whereas more sequential applications, such asoperating system kernel or application code may be better suited for theCPU.

In FIG. 10, processor 1000 includes a CPU 1005, GPU 1010, imageprocessor 1015, video processor 1020, USB controller 1025, UARTcontroller 1030, SPI/SDIO controller 1035, display device 1040, memoryinterface controller 1045, MIPI controller 1050, flash memory controller1055, dual data rate (DDR) controller 1060, security engine 1065, andI²S/I²C controller 1070. Other logic and circuits may be included in theprocessor of FIG. 10, including more CPUs or GPUs and other peripheralinterface controllers.

One or more aspects of at least one embodiment may be implemented byrepresentative data stored on a machine-readable medium which representsvarious logic within the processor, which when read by a machine causesthe machine to fabricate logic to perform the techniques describedherein. Such representations, known as “IP cores” may be stored on atangible, machine readable medium (“tape”) and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor. For example, IPcores, such as the Cortex™ family of processors developed by ARMHoldings, Ltd. and Loongson IP cores developed the Institute ofComputing Technology (ICT) of the Chinese Academy of Sciences may belicensed or sold to various customers or licensees, such as TexasInstruments, Qualcomm, Apple, or Samsung and implemented in processorsproduced by these customers or licensees.

FIG. 11 shows a block diagram illustrating the development of IP coresaccording to one embodiment. Storage 1130 includes simulation software1120 and/or hardware or software model 1110. In one embodiment, the datarepresenting the IP core design can be provided to the storage 1130 viamemory 1140 (e.g., hard disk), wired connection (e.g., internet) 1150 orwireless connection 1160. The IP core information generated by thesimulation tool and model can then be transmitted to a fabricationfacility where it can be fabricated by a 3^(rd) party to perform atleast one instruction in accordance with at least one embodiment.

In some embodiments, one or more instructions may correspond to a firsttype or architecture (e.g., x86) and be translated or emulated on aprocessor of a different type or architecture (e.g., ARM). Aninstruction, according to one embodiment, may therefore be performed onany processor or processor type, including ARM, x86, MIPS, a GPU, orother processor type or architecture.

FIG. 12 illustrates how an instruction of a first type is emulated by aprocessor of a different type, according to one embodiment. In FIG. 12,program 1205 contains some instructions that may perform the same orsubstantially the same function as an instruction according to oneembodiment. However the instructions of program 1205 may be of a typeand/or format that is different or incompatible with processor 1215,meaning the instructions of the type in program 1205 may not be able toexecuted natively by the processor 1215. However, with the help ofemulation logic, 1210, the instructions of program 1205 are translatedinto instructions that are natively capable of being executed by theprocessor 1215. In one embodiment, the emulation logic is embodied inhardware. In another embodiment, the emulation logic is embodied in atangible, machine-readable medium containing software to translateinstructions of the type in the program 1205 into the type nativelyexecutable by the processor 1215. In other embodiments, emulation logicis a combination of fixed-function or programmable hardware and aprogram stored on a tangible, machine-readable medium. In oneembodiment, the processor contains the emulation logic, whereas in otherembodiments, the emulation logic exists outside of the processor and isprovided by a third party. In one embodiment, the processor is capableof loading the emulation logic embodied in a tangible, machine-readablemedium containing software by executing microcode or firmware containedin or associated with the processor.

FIG. 13 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to embodimentsof the invention. In the illustrated embodiment, the instructionconverter is a software instruction converter, although alternativelythe instruction converter may be implemented in software, firmware,hardware, or various combinations thereof. FIG. 13 shows a program in ahigh level language 1302 may be compiled using an x86 compiler 1304 togenerate x86 binary code 1306 that may be natively executed by aprocessor with at least one x86 instruction set core 1316. The processorwith at least one x86 instruction set core 1316 represents any processorthat can perform substantially the same functions as a Intel processorwith at least one x86 instruction set core by compatibly executing orotherwise processing (1) a substantial portion of the instruction set ofthe Intel x86 instruction set core or (2) object code versions ofapplications or other software targeted to run on an Intel processorwith at least one x86 instruction set core, in order to achievesubstantially the same result as an Intel processor with at least onex86 instruction set core. The x86 compiler 1304 represents a compilerthat is operable to generate x86 binary code 1306 (e.g., object code)that can, with or without additional linkage processing, be executed onthe processor with at least one x86 instruction set core 1316.Similarly, FIG. 13 shows the program in the high level language 1302 maybe compiled using an alternative instruction set compiler 1308 togenerate alternative instruction set binary code 1310 that may benatively executed by a processor without at least one x86 instructionset core 1314 (e.g., a processor with cores that execute the MIPSinstruction set of MIPS Technologies of Sunnyvale, Calif. and/or thatexecute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.).The instruction converter 1312 is used to convert the x86 binary code1306 into code that may be natively executed by the processor without anx86 instruction set core 1314. This converted code is not likely to bethe same as the alternative instruction set binary code 1310 because aninstruction converter capable of this is difficult to make; however, theconverted code will accomplish the general operation and be made up ofinstructions from the alternative instruction set. Thus, the instructionconverter 1312 represents software, firmware, hardware, or a combinationthereof that, through emulation, simulation or any other process, allowsa processor or other electronic device that does not have an x86instruction set processor or core to execute the x86 binary code 1306.

FIG. 14 illustrates a method for performing a SHA digest computationusing SIMD instructions according to one embodiment. The SIMDinstructions may be based on the Intel SSE and AVX architectures—currentand future instructions. All of the five SHA algorithms SHA-1, SHA-224,SHA-256, SHA-384 and SHA-512 are iterative, one way hash functions thatcan process a message to produce a condensed representation called amessage digest. The following description uses SHA-512 as an exampleunless otherwise noted, but the method may be implemented in other SHAalgorithms as well.

At block 1402, a message may be preprocessed. For SHA-512 algorithm, themessage may be processed in message blocks of 1024 bits. Thepreprocessing for SHA-512 may be performed as follows:

1. Append one bit “1” to the message. 2. Append k bits “0”, where k isthe smallest non-negative integer such that the resulting message length(in bits) is congruent to 896 modulo 1024. That is, suppose the messageis L bits long, then L + 1 + k ≡ 896 mod 1024. 3. Append the length L,in bits of message (before pre-processing), represented as a 128-bitinteger in Big-Endian notation (the length of the padded message is nowa multiple of 1024 bits). 4. Parse the padded message as N 1024-bitmessage blocks, M¹, M², . . . , M^(N) 5. Set the initial hash values asfollows: H₀ ⁰ = 0x6a09e667f3bcc908, H₁ ⁰ = 0xbb67ae8584caa73b, H₂ ⁰ =0x3c6ef372fe94f82b, H₃ ⁰ = 0xa54ff53a5f1d36f1, H₄ ⁰ =0x510e527fade682d1, H₅ ⁰ = 0x9b05688c2b3e6c1f, H₆ ⁰ =0x1f83d9abfb41bd6b, H₇ ⁰ = 0x5be0cd19137e2179.

In one or more embodiments, the preprocessing step may include only theappending steps. The step of parsing the padded message into N 1024-bitmessage blocks may be performed as an individual step subsequent to thepreprocessing block only including the appending steps. Further, thestep of setting the initial hash values may be performed as anindividual step before, during or after steps of the preprocessing.

After the message blocks are parsed and the initial hash values are set.The method 1400 may continue to block 1404. At the block 1404, for everyi being an integer from 1 to floor(N/n), hash values for every n messageblocks may be generated using parallel message scheduling.

SHA-512 uses eighty 64-bit words, K₀ ⁵¹², K₁ ⁵¹², . . . , H₇₉ ⁵¹² (theseare the first sixty-four bits of the fractional parts of the cube rootsof the first eighty primes and a variety of math operations defined inFIPS 180-2 as follows (the notation“+” may indicate addition modulo2⁶⁴):

SHR ^(n)(x)=x>>n

ROTR ^(n)(x)=(x>>n)

(x<<(64−n))

Ch(x,y,z)=(x

y)⊕(

x

z)

Maj(x,y,z)=(x

y)⊕(x

z)⊕(y

z)

Σ₀ ⁵¹²(x)=ROTR ²⁸(x)⊕ROTR ³⁴(x)⊕ROTR ³⁹(x)

Σ₁ ⁵¹²(x)=ROTR ¹⁴(x)⊕ROTR ¹⁸(x)⊕ROTR ⁴¹(x)

σ₀ ⁵¹²(x)=ROTR ¹(x)⊕ROTR ⁸(x)⊕SHR ⁷(x)

σ₁ ⁵¹²(x)=ROTR ¹⁹(x)⊕ROTR ⁶¹(x)⊕SHR ⁶(x)

SHA-512 generates hash values as follows:

For i =1, 2, . . ., N (N being the total number of the message blocks tobe processed)  Prepare the Message schedule {W_(t)}:    $W_{t}\left\{ \begin{matrix}{{big}_{endian}(M)}_{t}^{i} & {0 \leq t \leq 15} \\{{\sigma_{1}^{512}\left( W_{t - 2} \right)} + W_{t - 7} + {\sigma_{0}^{512}\left( W_{t - 15} \right)} + \left( W_{t - 16} \right)} & {16 \leq t \leq 79}\end{matrix} \right.$  Set the eight working variables, a, b, c, d, e,f, g, h, to:   a = H₀ ^(i−1);b = H₁ ^(i−1);c = H₂ ^(i−1);d = H₃ ^(i−1);  e = H₄ ^(i−1);f = H₅ ^(i−1);g = H₆ ^(i−1);h = H₇ ^(i−1)  Compress: For t = 0 to 79:   $T_{1} = {h + {\sum\limits_{1}^{512}(e)} + {{ch}\left( {e,f,g} \right)} + K_{t}^{512} + W_{t}}$  $T_{2} = {{\sum\limits_{0}^{512}(a)} + {{Maj}\left( {a,b,c} \right)}}$  h = g;g = f;f = e;e = d + T₁;d = c;c = b;b = a;a = T₁ + T₂   Computethe i^(th)-step intermediate hash value H^(i):    H₀ ^(i−1) = a + H₀^(i−1);H₁ ^(i−1) = b + H₁ ^(i−1);H₂ ^(i−1) = c + H₂ ^(i−1);H₃ ^(i−1) =   d + H₃ ^(i−1);    H₄ ^(i−1) = e + H₄ ^(i−1);H₅ ^(i−1) = f + H₅^(i−1);H₆ ^(i−1) = g + H₆ ^(i−1);H₇ ^(i−1) =    h + H₇ ^(i−1) End ForAnd the resulting 512-bit message digest of the message may be generatedas:

H ₀ ^(N) ∥H ₁ ^(N) ∥H ₂ ^(N) ∥H ₃ ^(N) ∥H ₄ ^(N) ∥H ₅ ^(N) ∥H ₆ ^(N) ∥H₇ ^(N).

In one embodiment, the method 1400 may utilize registers' width of agiven SIMD architecture to compute, in parallel (and independently ofthe compression step), as many message schedules as possible. Forexample, the parameter n may be chosen by

$n = {\frac{{supported}\mspace{14mu} {SIMD}\mspace{14mu} {registers}\mspace{14mu} {width}}{{hash}\mspace{14mu} {function}\mspace{14mu} {word}\mspace{14mu} {size}}.}$

The block 1404 may be referred to as, for example, an n-SimultaneousMessage Scheduling (n-SMS).

Thus, for SHA-256, the compression function operates on k=32 bitelements. When running on an architecture that supports r=128 bitsregisters (e.g, XMM registers), the block 1404 may use n=r/k=128/32=4.On an architecture that supports r=256 bits registers (e.g., YMMregisters), the block 1404 may use n=r/k=256/32=8. For SHA-512, thecompression function operates on k=64 bit elements, and therefore n=2may be used on r=128 bits registers (e.g., SSE architecture), and n=4 onr=512 bits registers (e.g., the AVX2 architecture).

FIG. 15 shows an n-Simultaneous Message Scheduling (n-SMS) 1500according to one embodiment. As shown in FIG. 15, message block 0 tomessage block n−1 may be scheduled in parallel at message schedule 0 tomessage schedule n−1. A previous hash value 1502 may be compressed togenerate an intermediate hash value for the message block 0 at thecompression block 1504.1. Then, the intermediate hash value for themessage block 0 may be used to further another intermediate hash valuefor the message block 1 at the compression block 1504.2. Thereafter, thecompression may be repeated to generate subsequent intermediate hashvalue for subsequent the message blocks until at the compression block1504.n, the next hash value 1506 for the message block n−1 may begenerated.

In one embodiment, when n may be four, applying 4-SMS to SHA-512 mayallow the computation of four message schedules in parallel, used forfour 128-byte blocks of the same message (e.g., four 128-bit consecutiveblocks). When hashing a buffer containing the message to be hashed,4-SMS can be applied as long as the remaining portion of the buffercontains at least four blocks of the message (e.g., 512 bytes) to beprocessed (when the remaining portion is shorter, the standard serialcomputations may be carried out).

The constants used for 4-SMS SHA-512 may be eighty 64-bit constants, K′₀⁵¹², K′₁ ⁵¹², . . . , K′₇₉ ⁵¹² with each K′_(i) ⁵¹² being the SHA-512constants concatenated four times:: K′_(i) ⁵¹²=K_(i) ⁵¹²∥K_(i) ⁵¹²∥K_(i)⁵¹²∥K_(i) ⁵¹²;0≦i≦79.

The functions σ₀, σ₁, ROTR and SHR may be promoted to a 256-bitvectorized version based on parameters: X′=x₃∥x₂∥x₁∥x₀, andY′=y₃∥y₂∥y₁∥y₀, X′ and Y′ be 256-bit values consisting of four 64-bitqwords (x₀, x₁, x₂, x₃), (y₀, y₁, y₂, y₃.). The promoted σ₀, σ₁, ROTRand SHR functions may be as follows:

SHR′ ^(n)(X′)=SHR ^(n)(x ₃)∥SHR ^(n)(x ₂)∥SHR ^(n)(x ₁)∥SHR ^(n)(x ₀)

ROTR′ ^(n)(X′)=ROTR ^(n)(x ₃)∥ROTR ^(n)(x ₂)∥ROTR ^(n)(x ₁)∥ROTR ^(n)(x₀)

σ′₀ ⁵¹²(X′)=ROTR′ ¹(X′)⊕ROTR′ ⁸(X′)⊕SHR′ ⁷(X′)

σ′₀ ⁵¹²(X′)=ROTR′ ⁹(X′)⊕ROTR′ ⁶¹(X′)⊕SHR′ ⁶(X′)

X′+Y′=x ₃ +y ₃ ∥x ₂ +y ₂ ∥x ₁ +y ₁ ∥x ₀ +y ₀

Thus, the 4-SMS Update function may be

For i =1, 2, . . ., floor(N/4) (N being the total number of the messageblocks to be processed and floor ( ) being the floor function generatingthe largest integer value)  Prepare the “quadruped” message schedule,{W′_(t)}:    $W_{t}^{\prime} = \left\{ \begin{matrix}{{{{(M)_{t}^{{{({i - 1})} \times 4} + 4}{{(M)_{t}^{{{({i - 1})} \times 4} + 3}}}(M)_{t}^{{{({i - 1})} \times 4} + 2}}}}(M)_{t}^{{{({i - 1})} \times 4} + 1}} & {0 \leq t \leq 15} \\{{\sigma_{1}^{\prime 512}\left( W_{t - 2}^{\prime} \right)} + W_{t - 7}^{\prime} + {\sigma_{0}^{\prime 512}\left( W_{t - 15}^{\prime} \right)} + \left( W_{t - 16}^{\prime} \right)} & {16 \leq t \leq 79}\end{matrix} \right.$  Add the constants:   w′_(t) = w′_(t) + k′_(t)⁵¹²;0 ≦ t ≦ 79  Compress:   For j = 0 to 3:    Set the eight workingvariables, a, b, c, d, e, f, g, h, to:     a = H₀ ^((i−1)×4+j);b = H₁^((i−1)×4+j);c = H₂ ^((i−1)×4+j);d = H₃ ^((i−1)×4+j1);     e = H₄^((i−1)×4+j);f = H₅ ^((i−1)×4+j1);g = H₆ ^((i−1)×4+j);h = H₇^((i−1)×4+j)   For t = 0 to 79:    $T_{1} = {h + {\sum\limits_{1}^{512}(e)} + {{ch}\left( {e,f,g} \right)} + W_{t}^{\prime}}$   $T_{2} = {{\sum\limits_{0}^{512}(a)} + {{Maj}\left( {a,b,c} \right)}}$   h = g;g = f;f = e;e = d + T₁;d = c;c = b;b = a;a = T₁+ T₂   End for  Compute the [(i−1)×4+j+1]^(th) intermediate hash value H^(i):    H₀^((i−1)×4+j+1) = a + H₀ ^((i−1)×4+j);    H₁ ^((i−1)×4+j+1) = b + H₁^((i−1)×4+j);    H₂ ^((i−1)×4+j+1) = c + H₂ ^((i−1)×4+j);    H₃^((i−1)×4+j+1) = d + H₃ ^((i−1)×4+j);    H₄ ^((i−1)×4+j+1) = e + H₄^((i−1)×4+j);    H₅ ^((i−1)×4+j+1) = f + H₅ ^((i−1)×4+j);    H₆^((i−1)×4+j+1) = g + H₆ ^((i−1)×4+j);    H₇ ^((i−1)×4+j+1) = h + H₇^((i−1)×4+j)  End for End for

That is, if N is the number of message blocks in the padded message, andN=4×floor(N/4)+r, with r=0, 1, 2, or 3, the 4-SMS Update may beperformed on the first floor(N/4) quadrupled blocks.

Referring back to FIG. 14, after the block 1404, the method 1400 maycontinue to block 1406, where hash values for any remaining messageblocks (if the remainder r≠0) may be processed in the standard (serial)way as shown in Table 1 (for i=floor(N/4)+1, . . . , floor(N/4)+r) usingthe regular “Update” function.

After all the message blocks are processed, the method 1400 may continueto block 1408, where the resulting 512-bit message digest may becalculated as the concatenation of the hash values:H₀∥H₁∥H₂∥H₃∥H₄∥H₅∥H₆∥H₇.

In one or more embodiments, other steps of the algorithms may also beparallelized. One example may be the step of adding the constantsw′_(t)=w′_(t)+k′_(t) ⁵¹²;0≦t≦79 in the n-SMS Update function as shown inTable 3.

In one or more embodiments, the n-SMS Update function may be implementedin SIMD vector instructions. For example, to apply the 4-SMS method toSHA-512, the following AVX2 instructions may be used:

-   -   VPSLLQ (to compute the SHR′^(n) (X′) function),    -   the shift left/right and xor instructions: VPSLLQ, VPSRLQ and        VPXOR (to compute ROTR′^(n) (X′)),    -   VPADDQ (to compute “+”) and VPXOR (to compute “⊕”)    -   VPGATHERQ (to prepare the first 16 values of the message        schedule by loading 4 64-bit value into an ymm register)

An exemplary snippet of code for 4-SMS SHA-512 message schedulingimplemented using AVX2 C intrinsic is shown in Table 4 below. Theexample code may be complied by a compiler to use the AVX2 instructions(e.g., setting the ‘−xAVX2’ flag for an Intel compiler).

TABLE 4 #define vpbroadcastq(vec, k) vec =_mm256_broadcastq_epi64(*(_m128i*)k) // this function calculates thesmall sigma 0 transformation inline _m256i sigma_0(_m256i W) {  return _mm256_xor_si256(   _mm256_xor_si256(   _mm256_xor_si256(   _mm256_srli_epi64(W, 7),    _mm256_srli_epi64(W, 8)    ),  _mm_256_xor_si256(    _mm256_srli_epi64(W, 1),    _mm256_slli_epi64(W,56)    )   ),   _mm256_slli_epi64(W, 63)   ); } // this functioncalculates the small sigma 1 transformation inline _m256i sigma_1(_m256iW) {  return  _mm256_xor_si256(   _mm256_xor_si256(   _mm256_xor_si256(   _mm256_srli_epi64(W, 6),    _mm256_srli_epi64(W, 61)    ),  _mm256_xor_si256(    _mm256_srli_epi64(W, 19),    _mm256_slli_epi64(W,3)    )   ),   _mm256_slli_epi64(W, 45)   ); } // the message schedulinground #define SCHEDULE_ROUND(w1, w2, w3, w4) \   vpbroadcastq(Ki,&k[i]);\   s0 = sigma_0(w1); \   s1 = sigma_1(w2); \   schedule[i] =_mm256_add_epi64(w3, Ki); \   w3 = _mm256_add_epi64( \    _mm256_add_epi64(w3, w4), \     _mm256_add_epi64(s0, s1) \     ); \  i++; void SHA512_QMS(_mm256i schedule[80], uint64_t message[64]) { _m256i gather_mask = _mm256_setr_epi64x(0, 16, 32, 48);  _m256ibswap_mask =_mm256_set_epi8(8,9,10,11,12,13,14,15,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,0,1,2,3,4,5,6,7); _m256i W0, W1, W2, W3, W4, W5, W6, W7, W8, W9, W10, W11, W12, W13, W14,W15;  _m256i s0, s1, Ki, Wi;  int i;  W0 = _mm256_i64gather_epi64((constlong*)message, gather_mask, 8);  W0 = _mm256_shuffle_epi8(W0,bswap_mask);  W1 = _mm256_i64gather_epi64((const long*)&message[1],gather_mask, 8);  W1 = _mm256_shuffle_epi8(W1, bswap_mask);  W2 =_mm256_i64gather_epi64((const long*)&message[2], gather_mask, 8);  W2 =_mm256_shuffle_epi8(W2, bswap_mask);  W3 = _mm256_i64gather_epi64((constlong*)&message[3], gather_mask, 8);  W3 = _mm256_shuffle_epi8(W3,bswap_mask);  W4 = _mm256_i64gather_epi64((const long*)&message[4],gather_mask, 8);  W4 = _mm256_shuffle_epi8(W4, bswap_mask);  W5 =_mm256_i64gather_epi64((const long*)&message[5], gather_mask, 8);  W5 =_mm256_shuffle_epi8(W5, bswap_mask);  W6 = _mm256_i64gather_epi64((constlong*)&message[6], gather_mask, 8);  W6 = _mm256_shuffle_epi8(W6,bswap_mask);  W7 = _mm256_i64gather_epi64((const long*)&message[7],gather_mask, 8);  W7 = _mm256_shuffle_epi8(W7, bswap_mask);  W8 =_mm256_i64gather_epi64((const long*)&message[8], gather_mask, 8);  W8 =_mm256_shuffle_epi8(W8, bswap_mask);  W9 = _mm256_i64gather_epi64((constlong*)&message[9], gather_mask, 8);  W9 = _mm256_shuffle_epi8(W9,bswap_mask);  W10 = _mm256_i64gather_epi64((const long*)&message[10],gather_mask, 8);  W10 = _mm256_shuffle_epi8(W10, bswap_mask);  W11 =_mm256_i64gather_epi64((const long*)&message[11], gather_mask, 8);  W11= _mm256_shuffle_epi8(W11, bswap_mask);  W12 =_mm256_i64gather_epi64((const long*)&message[12], gather_mask, 8);  W12= _mm256_shuffle_epi8(W12, bswap_mask);  W13 =_mm256_i64gather_epi64((const long*)&message[13], gather_mask, 8);  W13= _mm256_shuffle_epi8(W13, bswap_mask);  W14 =_mm256_i64gather_epi64((const long*)&message[14], gather_mask, 8);  W14= _mm256_shuffle_epi8(W14, bswap_mask);  W15 =_mm256_i64gather_epi64((const long*)&message[15], gather_mask, 8);  W15= _mm256_shuffle_epi8(W15, bswap_mask); for(i=0; i<64; ) { SCHEDULE_ROUND(W1, W14, W0, W9);  SCHEDULE_ROUND(W2, W15, W1, W10); SCHEDULE_ROUND(W3, W0, W2, W11);  SCHEDULE_ROUND(W4, W1, W3, W12); SCHEDULE_ROUND(W5, W2, W4, W13);  SCHEDULE_ROUND(W6, W3, W5, W14); SCHEDULE_ROUND(W7, W4, W6, W15);  SCHEDULE_ROUND(W8, W5, W7, W0); SCHEDULE_ROUND(W9, W6, W8, W1);  SCHEDULE_ROUND(W10, W7, W9, W2); SCHEDULE_ROUND(W11, W8, W10, W3);  SCHEDULE_ROUND(W12, W9, W11, W4); SCHEDULE_ROUND(W13, W10, W12, W5);  SCHEDULE_ROUND(W14, W11, W13, W6); SCHEDULE_ROUND(W15, W12, W14, W7);  SCHEDULE_ROUND(W0, W13, W15, W8); }schedule[64] = _mm256_add_epi64(W0,_mm256_broadcastq_epi64(*(_m128i*)&k[64])); schedule[65] =_mm256_add_epi64(W1, _mm256_broadcastq_epi64(*(_m128i*)&k[65]));schedule[66] = _mm256_add_epi64(W2,_mm256_broadcastq_epi64(*(_m128i*)&k[66])); schedule[67] =_mm256_add_epi64(W3, _mm256_broadcastq_epi64(*(_m128i*)&k[67]));schedule[68] = _mm256_add_epi64(W4,_mm256_broadcastq_epi64(*(_m128i*)&k[68])); schedule[69] =_mm256_add_epi64(W5, _mm256_broadcastq_epi64(*(_m128i*)&k[69]));schedule[70] = _mm256_add_epi64(W6,_mm256_broadcastq_epi64(*(_m128i*)&k[70])); schedule[71] =_mm256_add_epi64(W7, _mm256_broadcastq_epi64(*(_m128i*)&k[71]));schedule[72] = _mm256_add_epi64(W8,_mm256_broadcastq_epi64(*(_m128i*)&k[72])); schedule[73] =_mm256_add_epi64(W9, _mm256_broadcastq_epi64(*(_m128i*)&k[73]));schedule[74] = _mm256_add_epi64(W10,_mm256_broadcastq_epi64(*(_m128i*)&k[74])); schedule[75] =_mm256_add_epi64(W11, _mm256_broadcastq_epi64(*(_m128i*)&k[75]));schedule[76] = _mm256_add_epi64(W12,_mm256_broadcastq_epi64(*(_m128i*)&k[76])); schedule[77] =_mm256_add_epi64(W13, _mm256_broadcastq_epi64(*(_m128i*)&k[77]));schedule[78] = _mm256_add_epi64(W14,_mm256_broadcastq_epi64(*(_m128i*)&k[78])); schedule[79] =_mm256_add_epi64(W15, _mm256_broadcastq_epi64(*(_m128i*)&k[79])); }

Embodiments of the method 1400 and n-Simultaneous Message Scheduling (nSMS) 1500 disclosed herein may be implemented in hardware, software,firmware, or a combination of such implementation approaches.Embodiments of the invention may be implemented as computer programs(e.g., an cryptographic system) or program code executing onprogrammable systems (e.g., the computing system 100) comprising atleast one processor, a storage system (including volatile andnon-volatile memory and/or storage elements), at least one input device(e.g., keyboard, mouse, touch screen), and at least one output device(e.g., a monitor, printer).

Embodiments of the mechanisms disclosed herein may be implemented inhardware, software, firmware, or a combination of such implementationapproaches. Embodiments of the invention may be implemented as computerprograms or program code executing on programmable systems comprising atleast one processor, a storage system (including volatile andnon-volatile memory and/or storage elements), at least one input device,and at least one output device.

Program code may be applied to input instructions to perform thefunctions described herein and generate output information. The outputinformation may be applied to one or more output devices, in knownfashion. For purposes of this application, a processing system includesany system that has a processor, such as, for example; a digital signalprocessor (DSP), a microcontroller, an application specific integratedcircuit (ASIC), or a microprocessor.

The program code may be implemented in a high level procedural or objectoriented programming language to communicate with a processing system.The program code may also be implemented in assembly or machinelanguage, if desired. In fact, the mechanisms described herein are notlimited in scope to any particular programming language. In any case,the language may be a compiled or interpreted language.

One or more aspects of at least one embodiment may be implemented byrepresentative instructions stored on a machine-readable medium whichrepresents various logic within the processor, which when read by amachine causes the machine to fabricate logic to perform the techniquesdescribed herein. Such representations, known as “IP cores” may bestored on a tangible, machine readable medium and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor.

Such machine-readable storage media may include, without limitation,non-transitory, tangible arrangements of articles manufactured or formedby a machine or device, including storage media such as hard disks, anyother type of disk including floppy disks, optical disks, compact diskread-only memories (CD-ROMs), compact disk rewritable's (CD-RWs), andmagneto-optical disks, semiconductor devices such as read-only memories(ROMs), random access memories (RAMS) such as dynamic random accessmemories (DRAMs), static random access memories (SRAMs), erasableprogrammable read-only memories (EPROMs), flash memories, electricallyerasable programmable read-only memories (EEPROMs), magnetic or opticalcards, or any other type of media suitable for storing electronicinstructions.

Accordingly, embodiments of the invention also include non-transitory,tangible machine-readable media containing instructions or containingdesign data, such as Hardware Description Language (HDL), which definesstructures, circuits, apparatuses, processors and/or system featuresdescribed herein. Such embodiments may also be referred to as programproducts.

In some cases, an instruction converter may be used to convert aninstruction from a source instruction set to a target instruction set.For example, the instruction converter may translate (e.g., using staticbinary translation, dynamic binary translation including dynamiccompilation), morph, emulate, or otherwise convert an instruction to oneor more other instructions to be processed by the core. The instructionconverter may be implemented in software, hardware, firmware, or acombination thereof. The instruction converter may be on processor, offprocessor, or part on and part off processor.

Thus, techniques for performing a SHA message digest computation usingSIMD instructions according to at least one embodiment are disclosed.While certain exemplary embodiments have been described and shown in theaccompanying drawings, it is to be understood that such embodiments aremerely illustrative of and not restrictive on the broad invention, andthat this invention not be limited to the specific constructions andarrangements shown and described, since various other modifications mayoccur to those ordinarily skilled in the art upon studying thisdisclosure. In an area of technology such as this, where growth is fastand further advancements are not easily foreseen, the disclosedembodiments may be readily modifiable in arrangement and detail asfacilitated by enabling technological advancements without departingfrom the principles of the present disclosure or the scope of theaccompanying claims.

What is claimed is:
 1. A processor comprising: logic to, according to aselected secure hash algorithm (SHA) algorithm, generate hash values bypreparing message schedules for a plurality of message blocks inparallel using single instruction multiple date (SIMD) instructions andperforming compression in serial; and logic to generate a message digestconforming to the secure hash algorithm (SHA) algorithm.
 2. Theprocessor of claim 1, wherein the parallel message schedule generationand serial compression are performed for i=1 to floor(N/n) where N beingnumber of total message blocks and n being determined based on theprocessor's supported SIMD register width and the selected SHAalgorithm's word size, wherein the hash values are generated bypreparing n message schedules in parallel using SIMD instructions andperforming compression in serial for the respective n message blocks. 3.The processor of claim 2, wherein for any remaining message blocks, thehash values are generated by preparing message schedules and performingcompression in serial.
 4. The processor of claim 2, wherein${n = \frac{W}{s}},$ with “W” being supported SIMD register width and“s” being hash function word size.
 5. The processor of claim 4, whereinwhen n=4 and the selected algorithm is SHA-512, the preparing messageschedules in parallel uses eighty 64-bit constants, K′₀ ⁵¹², K′₁ ⁵¹², .. . , K′₇₉ ⁵¹² with each K′_(i) ⁵¹² being the SHA-512 constantsconcatenated four times:: K′_(i) ⁵¹²=K_(i) ⁵¹²∥K_(i) ⁵¹²∥K_(i) ⁵¹²∥K_(i)⁵¹²;0≦i≦79.
 6. The processor of claim 5, wherein the preparing messageschedules in parallel uses vectorized operations as follows:SHR′ ^(n)(X′)=SHR ^(n)(x ₃)∥SHR ^(n)(x ₂)∥SHR ^(n)(x ₁)∥SHR ^(n)(x ₀)ROTR′ ^(n)(X′)=ROTR ^(n)(x ₃)∥ROTR ^(n)(x ₂)∥ROTR ^(n)(x ₁)∥ROTR ^(n)(x₀)σ′₀ ⁵¹²(X′)=ROTR′ ¹(X′)⊕ROTR′ ⁸(X′)⊕SHR′ ⁷(X′)σ′₀ ⁵¹²(X′)=ROTR′ ⁹(X′)⊕ROTR′ ⁶¹(X′)⊕SHR′ ⁶(X′)X′+Y′=x ₃ +y ₃ ∥x ₂ +y ₂ ∥x ₁ +y ₁ ∥x ₀ +y ₀ where X′=x₃∥x₂∥x₁∥x₀ andY′=y₃∥y₂∥y₁∥y₀, X′ and Y′ are 256-bit values and consist of four 64-bitqwords (x₀, x₁, x₂, x₃), (y₀, y₁, y₂, y₃).
 7. The processor of claim 2,wherein an add operation w′_(t)=w′_(t)+k′_(t) ⁵¹² is also performed inparallel after preparing message schedules in parallel using the SIMDinstructions, wherein w′_(t) is the tth message schedule.
 8. A methodcomprising: according to a selected secure hash algorithm (SHA)algorithm, generate hash values by preparing message schedules for aplurality of message blocks in parallel using single instructionmultiple date (SIMD) instructions and performing compression in serial;and logic to generate a message digest conforming to the secure hashalgorithm (SHA) algorithm.
 9. The method of claim 8, wherein theparallel message schedule generation and serial compression areperformed for i=1 to floor(N/n) where N being number of total messageblocks and n being determined based on the processor's supported SIMDregister width and the selected SHA algorithm's word size, wherein thehash values are generated by preparing n message schedules in parallelusing SIMD instructions and performing compression in serial for therespective n message blocks.
 10. The method of claim 9, wherein for anyremaining message blocks, the hash values are generated by preparingmessage schedules and performing compression in serial.
 11. The methodof claim 9, wherein ${n = \frac{W}{s}},$ with “W” being supported SIMDregister width and “s” being hash function word size.
 12. The method ofclaim 11, wherein when n=4 and the selected algorithm is SHA-512, thepreparing message schedules in parallel uses eighty 64-bit constants,K′₀ ⁵¹², K′₁ ⁵¹², . . . , K′₇₉ ⁵¹² with each K′_(i) ⁵¹² being theSHA-512 constants concatenated four times:: K′_(i) ⁵¹²=K_(i) ⁵¹²∥K_(i)⁵¹²∥K_(i) ⁵¹²∥K_(i) ⁵¹²;0≦i≦79.
 13. The method of claim 12, wherein thepreparing message schedules in parallel uses vectorized operations asfollows:SHR′ ^(n)(X′)=SHR ^(n)(x ₃)∥SHR ^(n)(x ₂)∥SHR ^(n)(x ₁)∥SHR ^(n)(x ₀)ROTR′ ^(n)(X′)=ROTR ^(n)(x ₃)∥ROTR ^(n)(x ₂)∥ROTR ^(n)(x ₁)∥ROTR ^(n)(x₀)σ′₀ ⁵¹²(X′)=ROTR′ ¹(X′)⊕ROTR′ ⁸(X′)⊕SHR′ ⁷(X′)σ′₀ ⁵¹²(X′)=ROTR′ ⁹(X′)⊕ROTR′ ⁶¹(X′)⊕SHR′ ⁶(X′)X′+Y′=x ₃ +y ₃ ∥x ₂ +y ₂ ∥x ₁ +y ₁ ∥x ₀ +y ₀ where X′=x₃∥x₂∥x₁∥x₀ andY′=y₃∥y₂∥y₁∥y₀, X′ and Y′ are 256-bit values and consist of four 64-bitqwords (x₀, x₁, x₂, x₃), (y₀, y₁, y₂, y₃).
 14. The method of claim 9,wherein an add operation w′_(t)=w′_(t)+k′_(t) ⁵¹² is also performed inparallel after preparing message schedules in parallel using the SIMDinstructions, wherein w′_(t) is the tth message schedule.
 15. A systemcomprising: a processor comprising: logic to, according to a selectedsecure hash algorithm (SHA) algorithm, generate hash values by preparingmessage schedules for a plurality of message blocks in parallel usingsingle instruction multiple date (SIMD) instructions and performingcompression in serial; and logic to generate a message digest conformingto the secure hash algorithm (SHA) algorithm.
 16. The system of claim15, wherein the parallel message schedule generation and serialcompression are performed for i=1 to floor(N/n) where N being number oftotal message blocks and n being determined based on the processor'ssupported SIMD register width and the selected SHA algorithm's wordsize, wherein the hash values are generated by preparing n messageschedules in parallel using SIMD instructions and performing compressionin serial for the respective n message blocks.
 17. The system of claim16, wherein for any remaining message blocks, the hash values aregenerated by preparing message schedules and performing compression inserial.
 18. The system of claim 16, wherein ${n = \frac{W}{s}},$ with“W” being supported SIMD register width and “s” being hash function wordsize.
 19. The system of claim 18, wherein when n=4 and the selectedalgorithm is SHA-512, the preparing message schedules in parallel useseighty 64-bit constants, K′₀ ⁵¹², K′₁ ⁵¹², . . . , K′₇₉ ⁵¹² with eachK′_(i) ⁵¹² being the SHA-512 constants concatenated four times:: K′_(i)⁵¹²=K_(i) ⁵¹²∥K_(i) ⁵¹²∥K_(i) ⁵¹²∥K_(i) ⁵¹²;0≦i≦79.
 20. The system ofclaim 19, wherein the preparing message schedules in parallel usesvectorized operations as follows:SHR′ ^(n)(X′)=SHR ^(n)(x ₃)∥SHR ^(n)(x ₂)∥SHR ^(n)(x ₁)∥SHR ^(n)(x ₀)ROTR′ ^(n)(X′)=ROTR ^(n)(x ₃)∥ROTR ^(n)(x ₂)∥ROTR ^(n)(x ₁)∥ROTR ^(n)(x₀)σ′₀ ⁵¹²(X′)=ROTR′ ¹(X′)⊕ROTR′ ⁸(X′)⊕SHR′ ⁷(X′)σ′₀ ⁵¹²(X′)=ROTR′ ⁹(X′)⊕ROTR′ ⁶¹(X′)⊕SHR′ ⁶(X′)X′+Y′=x ₃ +y ₃ ∥x ₂ +y ₂ ∥x ₁ +y ₁ ∥x ₀ +y ₀ where X′=x₃∥x₂∥x₁∥x₀ andY′=y₃∥y₂∥y₁∥y₀, X′ and Y′ are 256-bit values and consist of four 64-bitqwords (x₀, x₁, x₂, x₃), (y₀, y₁, y₂, y₃).
 21. The system of claim 16,wherein an add operation w′_(t)=w′_(t)+k′_(t) ⁵¹² is also performed inparallel after preparing message schedules in parallel using the SIMDinstructions, wherein w′_(t) is the tth message schedule.
 22. Anon-transitory machine-readable medium having stored thereoninstructions for causing a processor to execute a method, the methodcomprising: logic to, according to a selected secure hash algorithm(SHA) algorithm, generate hash values by preparing message schedules fora plurality of message blocks in parallel using single instructionmultiple date (SIMD) instructions and performing compression in serial;and logic to generate a message digest conforming to the secure hashalgorithm (SHA) algorithm.
 23. The non-transitory machine-readablemedium of claim 22, wherein the parallel message schedule generation andserial compression are performed for i=1 to floor(N/n) where N beingnumber of total message blocks and n being determined based on theprocessor's supported SIMD register width and the selected SHAalgorithm's word size, wherein the hash values are generated bypreparing n message schedules in parallel using SIMD instructions andperforming compression in serial for the respective n message blocks.24. The non-transitory machine-readable medium of claim 23, wherein forany remaining message blocks, the hash values are generated by preparingmessage schedules and performing compression in serial.
 25. Thenon-transitory machine-readable medium of claim 24, wherein${n = \frac{W}{s}},$ with “W” being supported SIMD register width and“s” being hash function word size.
 26. The non-transitorymachine-readable medium of claim 25, wherein when n=4 and the selectedalgorithm is SHA-512, the preparing message schedules in parallel useseighty 64-bit constants, K′₀ ⁵¹², K′₁ ⁵¹², . . . , K′₇₉ ⁵¹² with eachK′_(i) ⁵¹² being the SHA-512 constants concatenated four times:: K′_(i)⁵¹²=K_(i) ⁵¹²∥K_(i) ⁵¹²∥K_(i) ⁵¹²∥K_(i) ⁵¹²;0≦i≦79.
 27. Thenon-transitory machine-readable medium of claim 26, wherein thepreparing message schedules in parallel uses vectorized operations asfollows:SHR′ ^(n)(X′)=SHR ^(n)(x ₃)∥SHR ^(n)(x ₂)∥SHR ^(n)(x ₁)∥SHR ^(n)(x ₀)ROTR′ ^(n)(X′)=ROTR ^(n)(x ₃)∥ROTR ^(n)(x ₂)∥ROTR ^(n)(x ₁)∥ROTR ^(n)(x₀)σ′₀ ⁵¹²(X′)=ROTR′ ¹(X′)⊕ROTR′ ⁸(X′)⊕SHR′ ⁷(X′)σ′₀ ⁵¹²(X′)=ROTR′ ⁹(X′)⊕ROTR′ ⁶¹(X′)⊕SHR′ ⁶(X′)X′+Y′=x ₃ +y ₃ ∥x ₂ +y ₂ ∥x ₁ +y ₁ ∥x ₀ +y ₀ where X′=x₃∥x₂∥x₁∥x₀ andY′=y₃∥y₂∥y₁∥y₀, X′ and Y′ are 256-bit values and consist of four 64-bitqwords (x₀, x₁, x₂, x₃), (y₀, y₁, y₂, y₃).
 28. The processor of claim23, wherein an add operation w′_(t)=w′_(t)+k′_(t) ⁵¹² is also performedin parallel after preparing message schedules in parallel using the SIMDinstructions, wherein w′_(t) is the tth message schedule.